Kharita: Robust Map Inference using Graph Spanners
نویسندگان
چکیده
ewidespread availability of GPS information in everyday devices such as cars, smartphones and smart watches make it possible to collect large amount of geospatial trajectory information. A particularly important, yet technically challenging, application of this data is to identify the underlying road network and keep it updated under various changes. In this paper, we propose ecient algorithms that can generate accuratemaps in both batch and online seings. Our algorithms utilize techniques from graph spanners so that they produce maps can eectively handle a wide variety of road and intersection shapes. We conduct a rigorous evaluation of our algorithms over two real-world datasets and under a wide variety of performance metrics. Our experiments show a signicant improvement over prior work. In particular, we observe an increase in Biagioni f -score of up to 20% when compared to the state of the art while reducing the execution time by an order of magnitude. We also make our source code open source for reproducibility and enable other researchers to build on our work.
منابع مشابه
$\mathcal{O}(k)$-robust spanners in one dimension
A geometric t-spanner on a set of points in Euclidean space is a graph containing for every pair of points a path of length at most t times the Euclidean distance between the points. Informally, a spanner is O(k)-robust if deleting k vertices only harms O(k) other vertices. We show that on any one-dimensional set of n points, for any ε > 0, there exists an O(k)-robust 1-spanner with O(n1+ε) edg...
متن کاملExpected Path Degradation when Searching over a Sparse Grid Hierarchy
The traditional focus of combinatorial search research is to speed up the search algorithm. An alternative, however, is to create a sparser representation of the search space. This relates to the idea of spanners from graph theory. These are subgraphs which retain paths between any two vertices of the original graph while guaranteeing a maximum stretch in path length. In practice, the path degr...
متن کاملA Document Spanners: A Formal Approach to Information Extraction
An intrinsic part of information extraction is the creation and manipulation of relations extracted from text. In this article, we develop a foundational framework where the central construct is what we call a document spanner (or just spanner for short). A spanner maps an input string into a relation over the spans (intervals specified by bounding indices) of the string. The focus of this arti...
متن کاملConstruction of Minimum-Weight Spanners
Spanners are sparse subgraphs that preserve distances up to a given factor in the underlying graph. Recently spanners have found important practical applications in metric space searching and message distribution in networks. These applications use some variant of the socalled greedy algorithm for constructing the spanner — an algorithm that mimics Kruskal’s minimum spanning tree algorithm. Gre...
متن کاملCollective Tree Spanners in Graphs with Bounded Genus, Chordality, Tree-Width, or Clique-Width
In this paper we study collective additive tree spanners for special families of graphs including planar graphs, graphs with bounded genus, graphs with bounded tree-width, graphs with bounded cliquewidth, and graphs with bounded chordality. We say that a graph G = (V,E) admits a system of μ collective additive tree r-spanners if there is a system T (G) of at most μ spanning trees of G such that...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1702.06025 شماره
صفحات -
تاریخ انتشار 2017